Routing algorithms

Results: 695



#Item
91Fault-Tolerant Aggregation by Flow Updating Paulo Jesus, Carlos Baquero, and Paulo S´ergio Almeida University of Minho (CCTC-DI) Campus de Gualtar, Braga, Portugal {pcoj, cbm, psa}@di.uminho.pt

Fault-Tolerant Aggregation by Flow Updating Paulo Jesus, Carlos Baquero, and Paulo S´ergio Almeida University of Minho (CCTC-DI) Campus de Gualtar, Braga, Portugal {pcoj, cbm, psa}@di.uminho.pt

Add to Reading List

Source URL: gsd.di.uminho.pt

Language: English - Date: 2015-03-13 12:52:43
92Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Extended Abstract) Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1, 1

Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Extended Abstract) Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1, 1

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2007-09-10 05:50:03
93Distributed Computing manuscript No. (will be inserted by the editor) Joan Feigenbaum · Rahul Sami · Scott Shenker  Mechanism Design for Policy Routing

Distributed Computing manuscript No. (will be inserted by the editor) Joan Feigenbaum · Rahul Sami · Scott Shenker Mechanism Design for Policy Routing

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2005-10-15 13:14:00
94Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-05-18 03:15:30
95Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen  Abstract— In this paper we present a design methodology

Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen Abstract— In this paper we present a design methodology

Add to Reading List

Source URL: www.researchgate.net

Language: English
96DISTRIBUTED ALGORITHMS FOR BASIS PURSUIT João F. C. Mota†‡ , João M. F. Xavier† , Pedro M. Q. Aguiar† , Markus Püschel‡ † Institute for Systems and Robotics / IST, Lisboa, Portugal {jmota,jxavier,aguiar}@i

DISTRIBUTED ALGORITHMS FOR BASIS PURSUIT João F. C. Mota†‡ , João M. F. Xavier† , Pedro M. Q. Aguiar† , Markus Püschel‡ † Institute for Systems and Robotics / IST, Lisboa, Portugal {jmota,jxavier,aguiar}@i

Add to Reading List

Source URL: www.ee.ucl.ac.uk

Language: English - Date: 2013-07-05 07:45:59
97Averting Void Routing In Geo Graphic Routing Protocol Using Virtual Co-Ordinates in WSN Veeresh M.Tech, PG, Lingaraj Appa Engineering College, Bidar, 585403.

Averting Void Routing In Geo Graphic Routing Protocol Using Virtual Co-Ordinates in WSN Veeresh M.Tech, PG, Lingaraj Appa Engineering College, Bidar, 585403.

Add to Reading List

Source URL: www.ijmetmr.com

Language: English - Date: 2016-08-09 06:22:43
98Principles of resource allocation in networks Devavrat Shah (MIT) and Damon Wischik (UCL) ABSTRACT  Step 1: identify the feasible region.

Principles of resource allocation in networks Devavrat Shah (MIT) and Damon Wischik (UCL) ABSTRACT Step 1: identify the feasible region.

Add to Reading List

Source URL: edusigcomm.info.ucl.ac.be

Language: English - Date: 2011-05-03 11:36:13
99D-ADMM: A DISTRIBUTED ALGORITHM FOR COMPRESSED SENSING AND OTHER SEPARABLE OPTIMIZATION PROBLEMS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1  2

D-ADMM: A DISTRIBUTED ALGORITHM FOR COMPRESSED SENSING AND OTHER SEPARABLE OPTIMIZATION PROBLEMS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 2

Add to Reading List

Source URL: users.isr.ist.utl.pt

Language: English - Date: 2012-01-20 04:32:38
100A BGP-based Mechanism for Lowest-Cost Routing∗ † Joan Feigenbaum  ‡

A BGP-based Mechanism for Lowest-Cost Routing∗ † Joan Feigenbaum ‡

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2002-08-12 09:52:11